Generalized Plan Recognition

نویسندگان

  • Henry A. Kautz
  • James F. Allen
چکیده

This pa r er outlines a new theory of plan recognition that is significant y more powerful than previous approaches. Concurrent actions. shared steps between actions, and disjunctive information are all handled. The theory allows one to draw conclusions based on the class of possible plans being performed, rather than having to prematurely commit to a single interpretation. The theory employs circumscription to transform a first-order theory of action into an action taxonomy. which can be used to logically deduce the complex action(s) an agent is performing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

String Shuffling over a Gap between Parsing and Plan Recognition

We propose a new probabilistic plan recognition algorithm YR based on an extension of Tomita’s Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR significantly outperforms previous approaches based on topdown parsers, shows more consistent run times among similar libraries, and degrades more gracefully as plan library complexity increases. YR also lifts the restrict...

متن کامل

OPTIMUM GENERALIZED COMPOUND LINEAR PLAN FOR MULTIPLE-STEP STEP-STRESS ACCELERATED LIFE TESTS

In this paper, we consider an  i.e., multiple step-stress accelerated life testing (ALT) experiment with unequal duration of time . It is assumed that the time to failure of a product follows Rayleigh distribution with a log-linear relationship between stress and lifetime and also we assume a generalized Khamis-Higgins model for the effect of changing stress levels. Taking into account that the...

متن کامل

Extending the Role of user Feedback in Plan Recognition and Response Generation for Advice-Giving Systems: An Initial Report

In this paper we outline a model for plan recognition in advice-giving settings which incorporates user modeling techniques and we show how to extend it to allow a wider range of user feedback than in previous plan recognition models. In particular, we discuss how this model allows for clariication dialogues both in cases where there are faults in a user's plan and in cases where alternate deco...

متن کامل

Program Understanding A Constraint Satisfaction Modeling Framework Understanding as Plan Recognition

Di erent program understanding algorithms often use di erent representational frameworks and take advantage of numerous heuristic tricks This situation makes it is di cult to compare these approaches and their performance This paper addresses this problem by proposing constraint sat isfaction as a general framework for describing program understanding algorithms demonstrating how to tranform a ...

متن کامل

Contents 1 A Constraint - Satisfaction Framework for Evaluating Program

Di erent program understanding algorithms often use di erent representational frameworks and take advantage of numerous heuristic tricks. This situation makes it is di cult to compare these approaches and their performance. This paper addresses this problem by proposing constraint satisfaction as a general framework for describing program understanding algorithms, demonstrating how to tranform ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1986